package com.acwing.partition3;

import java.io.*;

/**
 * @author `RKC`
 * @date 2021/11/27 21:41
 */
public class AC279自然数拆分 {

    private static final long MOD = 2147483648L;

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
        int n = Integer.parseInt(reader.readLine().split(" ")[0]);
        writer.write(dynamicProgramming(n) + "\n");
        writer.flush();
    }

    private static int dynamicProgramming(int n) {
        //用物品1到n-1来装满容量为n的背包，有多少种方式可以装满
        long[] dp = new long[n + 1];
        dp[0] = 1;
        for (int i = 1; i < n; i++) {
            for (int j = i; j <= n; j++) {
                dp[j] = (dp[j] + dp[j - i]) % MOD;
            }
        }
        return (int) dp[n];
    }
}
